Study of Probabilistic Worst Case Inter-Beacon Delays Under Realistic Vehicular Mobility Conditions
نویسنده
چکیده
Road safety applications are one of the main incentives to deploy vehicular networks. These applications rely on periodic message exchange among vehicles (known as beaconing). The beacon messages contain information about the environment which is used to perceive dangerous situations and alert the drivers. The inter-beacon delay is the time between two consecutive beacons received from a car. It is an essential parameter because, if this delay exceeds the application requirement, the application cannot accurately predict dangerous situations and alert the drivers on time. The worst case inter-beacon delay has thus to be bounded according to the application requirements. Unfortunately, a tight and strict bound is in fact very difficult to obtain for a real network because of the randomness of the collisions among beacons coming from: the unpredictable mobility patterns, random interferences, randomness of the MAC layer backoff, etc. In this paper, we propose to provide a probabilistic worst-case of the inter-beacon delay under realistic mobility using Extreme Value Theory (EVT). EVT provides statistical tools which allow to make predictions on extreme deviations from the average of a parameter. These statistical predictions can be made based on data gathered from simulation or experimentation. We first introduce the EVT technique. Then we discuss its application to the study of inter-beacon delays. Finally, we apply EVT on the results of extensive vehicular network simulation using a realistic mobility trace: the Cologne trace.
منابع مشابه
Design and Analysis of Realistic Mobility Models for Wireless Mesh Networks
Vehicular ad-hoc networks are a prospective technology which contribute to safer and more efficient roads. Inter-vehicle communication provides drivers and concerned authorities with information about road conditions, supports the coordination in case of emergency and improves traffic management. Furthermore, vehicular ad-hoc networks offer information and entertainment services to mobile users...
متن کاملEffect of Realistic Vehicular Traces on the Performance of Broadcasting Techniques in Vehicular Ad Hoc Networks
In this study, performance analysis of different broadcasting methods i.e., flooding and probabilistic broadcasting inside the geocast region has been done. We have considered an urban scenario where radio transmission is obstructed due to presence of high rise buildings, trees and other objects. Our objective is to provide a comparative analysis between flooding and probabilistic methods with ...
متن کاملRealistic Mobility Models for Vanet Network Simulation
In the performance evaluation of a protocol for a vehicular ad hoc network, the protocol should be tested under a realistic conditions including, representative data traffic models, and realistic movements of the mobile nodes which are the vehicles (i.e., a mobility model). This work is a comparative study between two mobility models that are used in the simulations of vehicular networks, i.e.,...
متن کاملImportance of realistic mobility models for vanet network simulation
In the performance evaluation of a protocol for a vehicular ad hoc network, the protocol should be tested under a realistic conditions including, representative data traffic models, and realistic movements of the mobile nodes which are the vehicles (i.e., a mobility model). This work is a comparative study between two mobility models that are used in the simulations of vehicular networks, i.e.,...
متن کاملA new virtual leader-following consensus protocol to internal and string stability analysis of longitudinal platoon of vehicles with generic network topology under communication and parasitic delays
In this paper, a new virtual leader following consensus protocol is introduced to perform the internal and string stability analysis of longitudinal platoon of vehicles under generic network topology. In all previous studies on multi-agent systems with generic network topology, the control parameters are strictly dependent on eigenvalues of network matrices (adjacency or Laplacian). Since some ...
متن کامل